Sequence Comparison Alignment-Free Approach Based on Suffix Tree andL-WordsFrequency
نویسندگان
چکیده
منابع مشابه
Sequence Comparison Alignment-Free Approach Based on Suffix Tree and L-Words Frequency
The vast majority of methods available for sequence comparison rely on a first sequence alignment step, which requires a number of assumptions on evolutionary history and is sometimes very difficult or impossible to perform due to the abundance of gaps (insertions/deletions). In such cases, an alternative alignment-free method would prove valuable. Our method starts by a computation of a genera...
متن کاملSuffix tree-based approach to detecting duplications in sequence diagrams
Models are core artefacts in software development and maintenance. Consequently, quality of models, especially maintainability and extensibility, becomes a big concern for most non-trivial applications. For some reasons, software models usually contain some duplications. These duplications had better be detected and removed because the duplications may reduce maintainability, extensibility and ...
متن کاملUsing an Extended Suffix Tree to Speed-up Sequence Alignment
An important problem in computational biology is the alignment of a given query sequence and sequences in a database to find similar (locally or globally) sequences from the database to the query. Many heuristic algorithms for this problem are based on the idea of locating a fixed-length matching pair of substrings (called a seed) to start an alignment, and then extending this alignment using d...
متن کاملFaster Sequence Alignment using Suffix Tree and Data-Mining Techniques
This thesis presents an application of a generalized suffix tree extended by the use of frequency of patterns, to perform accurate and faster biological sequence analysis as an improvement on the computation time of existing tools in this area. This application utilizes the knowledge of frequency of prefixes shared by two or more sequences in a generalized suffix tree, to identify with good acc...
متن کاملMultiple alignment-free sequence comparison
MOTIVATION Recently, a range of new statistics have become available for the alignment-free comparison of two sequences based on k-tuple word content. Here, we extend these statistics to the simultaneous comparison of more than two sequences. Our suite of statistics contains, first, C(*)1 and C(S)1, extensions of statistics for pairwise comparison of the joint k-tuple content of all the sequenc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Scientific World Journal
سال: 2012
ISSN: 1537-744X
DOI: 10.1100/2012/450124